Nearest Keyword Set Search in Multi-Dimensional Datasets
نویسندگان
چکیده
منابع مشابه
k-nearest keyword search in RDF graphs
Resource Description Framework (RDF) has been widely used as a W3C standard to describe the resource information in the Semantic Web. A standard SPARQL query over RDF data requires query issuers to fully understand the domain knowledge of the data. Because of this fact, SPARQL queries over RDF data are not flexible and it is difficult for non-experts to create queries without knowing the underl...
متن کاملSpatial Index Keyword Search in Multi dimensional Database
An efficient algorithm for spatial databases, various approaches are delivered by the various researchers for finding the result based on the keywords, and usually spatial query is a combination of a location and set of features. in this paper, has a few deficiencies that seriously impact its efficiency. Motivated by this, we develop a new access method called the spatial inverted index that ex...
متن کاملGroup Nearest Query Search in Multi-dimensional Spatial Data
Advanced Multi-dimensional based search query in text-rich multi-dimensional datasets facilitates many novel applications and tools. In this work, we consider objects that are tagged with keywords and are embedded in a vector space. For these datasets, queries that ask for the tightest groups of points satisfying a given set of keywords. The proposed novel method called Projection and Multi Sca...
متن کاملAccelerating Fractal Image Compression by Multi-Dimensional Nearest Neighbor Search
In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried out while trying to find a best match for another image portion. Our theory developed here shows that this basic procedure of fractal image compression is equivalent to multi-dimensional nearest neighbor search. This res...
متن کاملAn Approach to Nearest Neighboring Search for Multi-dimensional Data
Finding nearest neighbors in large multi-dimensional data has always been one of the research interests in data mining field. In this paper, we present our continuous research on similarity search problems. Previously we have worked on exploring the meaning of K nearest neighbors from a new perspective in PanKNN [20]. It redefines the distances between data points and a given query point Q, eff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2016
ISSN: 1041-4347
DOI: 10.1109/tkde.2015.2492549